More Specific Term Rewriting Systems ∗
نویسندگان
چکیده
There are properties of rewriting systems that are characterized by means of some syntactic conditions (e.g., requiring left-linear and non-overlapping rules for ensuring confluence). Sometimes, though, a given property might hold but the syntactic conditions are not met. This is particularly true when the systems are obtained by some automated transformation. In this paper, we introduce a technique that allows us to replace a rule of a rewriting system by a more specific version (an instance) of this rule so that a particular class of reductions can still be performed in the more specific system. This transformation might help to make some properties explicit (e.g., transforming an overlapping system having the unique normal form property into a non-overlapping one). We provide an algorithm to compute more specific versions of rewriting systems based on narrowing.
منابع مشابه
Term Graph Rewriting and Strong Sequentiality
This paper propagates the use of term graph rewriting systems as a formal computational model. The deenition of both term graphs and the reduction relation on term graphs are more complex than their corresponding notions in term rewriting systems. Consequently, it is often believed that reasoning about term graph rewriting systems is inherently more diicult than reasoning about term rewriting s...
متن کاملProving Termination Properties with mu-term
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost rewriting, termination of order-sorted rewriting, termination of context-sensitive rewriting, termination of innermost context-sensitive rewriting and termination of rewriting modulo specific axioms. Such termination ...
متن کاملNumber representations and term rewriting
In this paper we examine a number of term rewriting system for integer number representations, building further upon the datatype defining systems described in [2]. In particular, we look at automated methods for proving confluence and termination in binary and decimal term rewriting systems for both append and tree constructor functions. We find that some of these term rewriting systems are no...
متن کاملSound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. More precisely, we show that every weakly-leftlinear deterministic conditional term rewriting system can be converted to an equivalent weakly-leftline...
متن کاملParallel Closure Theorem for Left-Linear Nominal Rewriting Systems
Nominal rewriting has been introduced as an extension of first-order term rewriting by a binding mechanism based on the nominal approach. In this paper, we extend Huet’s parallel closure theorem and its generalisation on confluence of left-linear term rewriting systems to the case of nominal rewriting. The proof of the theorem follows a previous inductive confluence proof for orthogonal uniform...
متن کامل